Robust optimization for identical parallel machine scheduling with uncertain processing time
نویسندگان
چکیده
منابع مشابه
Identical parallel machine scheduling with time-dependent processing times
In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total ...
متن کاملNon-identical Parallel Machine Scheduling with Fuzzy Processing times Using Robust Genetic Algorithm and Simulation
This paper addresses non-identical parallel machine scheduling problem with fuzzy processing times (FPMSP). A robust genetic algorithm (GA) approach embedded in a simulation model to minimize maximum completion time (makespan) is proposed. The results are compared with those obtained by using LPT rule, known as the most appropriate dispatching rule for such problems. This application illustrate...
متن کاملBi-objective scheduling on parallel machines with uncertain processing time
In this paper we consider bi-criteria scheduling problem on parallel machines which optimizes the number of tardy jobs with the condition of primary criterion of Tmax remains optimized. The processing times of jobs are uncertain that is not known exactly and only estimated values are given. This leads to the use of fuzzy numbers for representing these imprecise values. Here, we use triangular f...
متن کاملParallel Machine Scheduling with Uncertain Communication Delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabili...
متن کاملRobust single machine scheduling for minimizing total flow time in the presence of uncertain processing times
This research deals with the single machine scheduling problem (SMSP) with uncertain job processing times. The single machine robust scheduling problem (SMRSP) aims to obtain robust job sequences with minimum worst-case total flow time. We describe uncertain processing times using intervals, and adopt an uncertainty set that incorporates a budget parameter to control the degree of conservatism....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Mechanical Design, Systems, and Manufacturing
سال: 2014
ISSN: 1881-3054
DOI: 10.1299/jamdsm.2014jamdsm0015